Sizes of Induced Subgraphs of Ramsey Graphs
نویسندگان
چکیده
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs any two of which differ either in the number of vertices or in the number of edges, i.e. the number of distinct pairs (|V (H)|, |E(H)|), as H ranges over all induced subgraphs of G, is Ω(n5/2). We prove an Ω(n2.3693) lower bound.
منابع مشابه
Ramsey Graphs Induce Subgraphs of Many Different Sizes
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph has size at most C log n. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed C > 0, every C-Ramsey graph on n vertices i...
متن کاملInduced subgraphs with distinct sizes
We show that for every 0 < < 1/2, there is an n0 = n0( ) such that if n > n0 then every n-vertex graph G of size at least ( n 2 ) and at most (1 − ) ( n 2 ) contains induced k-vertex subgraphs with at least 10−7k different sizes, for every k ≤ n 3 . This is best possible, up to a constant factor. This is also a step towards a conjecture by Erdős, Faudree and Sós on the number of distinct pairs ...
متن کاملInduced subgraphs with distinct size or order
We show that for every 0 < < 1/2, there is an n0 = n0( ) such that if n > n0 then every n-vertex graph G of size at least ( n 2 ) and at most (1 − ) ( n 2 ) contains induced k-vertex subgraphs with at least 10−7k different sizes, for every k ≤ n 3 This is best possible, up to a constant factor. This is also a step towards a conjecture by Erdős, Faudree and Sós on the number of distinct pairs (|...
متن کاملRamsey graphs contain many distinct induced subgraphs
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./( 2r2o ~2t)) distinct induced subgraphs.
متن کاملOn Subgraphs Induced by Transversals in Vertex-Partitions of Graphs
For a fixed graph H on k vertices, we investigate the graphs, G, such that for any partition of the vertices of G into k color classes, there is a transversal of that partition inducing H. For every integer k ≥ 1, we find a family F of at most six graphs on k vertices such that the following holds. If H / ∈ F , then for any graph G on at least 4k − 1 vertices, there is a k-coloring of vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 18 شماره
صفحات -
تاریخ انتشار 2009